Sensor Node Deployment in Wireless Sensor Networks based on Ionic Bond-Directed Particle Swarm Optimization

نویسندگان

  • Haiping Huang
  • Junqing Zhang
  • Ruchuan Wang
  • Yisheng Qian
چکیده

Sensor node deployment is one of the critical topics addressed in wireless sensor networks (WSNs) research, which determines coverage efficiency of WSNs. This paper proposes a self-organizing algorithm for enhancing the coverage for WSNs, which is so-called Ionic bond-directed particle swarm optimization (IBPSO). The proposed algorithm combines the ionic bond method with particle swarm optimization (PSO), where ionic bond method uses a judicious ionic bond between two sensor nodes to determine which node needs to move and also the path and direction of the movement and PSO is suitable for solving multi-dimension function optimization in continuous space. Simulation results demonstrate that IBPSO has more satisfactory performance on regional convergence and global searching than PSO algorithm and can implement dynamic deployment of WSNs more efficiently and rapidly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Intelligent Single Particle Optimizer Based Wireless Sensor Networks Adaptive Coverage

This paper studies wireless sensor networks node deployment problem and proposes intelligent single particle optimizer based wireless sensor networks adaptive coverage. According to the probability model measure characteristic of wireless sensor nodes, the method adaptively determines the optimal deployment of sensor nodes using intelligent single particle optimizer, achieving sensor node based...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

An Improved Co-evolutionary Particle Swarm Optimization for Wireless Sensor Networks with Dynamic Deployment

The effectiveness of wireless sensor networks (WSNs) depends on the coverage and target detection probability provided by dynamic deployment, which is usually supported by the virtual force (VF) algorithm. However, in the VF algorithm, the virtual force exerted by stationary sensor nodes will hinder the movement of mobile sensor nodes. Particle swarm optimization (PSO) is introduced as another ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013